Fundamentals of Computer Algorithms

نویسندگان

  • Ellis Horowitz
  • Sartaj Sahni
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithms in C++ - Parts 1-4: Fundamentals, Data Structures, Sorting, Searching

algorithms in c parts 1 4 fundamentals data structures algorithms in c parts 1 4 fundamentals data structures algorithms in c parts 1 4 fundamentals data structures algorithms in c parts 1 4 fundamentals data structures algorithms in c parts 1 4 fundamentals data structures algorithms in c parts 1 4 fundamentals data structures document about algorithms in c parts 1 4 fundamentals data algorith...

متن کامل

Fundamentals of the Capture Zone Calculations to Qualitatively Protect Cities Drinking Water Wells

This study is an attempt to introduce scientific fundamentals and available methods for wellhead protection area (capture zone) delineation for drinking water wells in cities. The results of this study could obviate some demands of the national water and wastewater company in quality control of the drinking water resources by delineation and application of the wellhead protection areas. For thi...

متن کامل

Fundamentals of the Capture Zone Calculations to Qualitatively Protect Cities Drinking Water Wells

This study is an attempt to introduce scientific fundamentals and available methods for wellhead protection area (capture zone) delineation for drinking water wells in cities. The results of this study could obviate some demands of the national water and wastewater company in quality control of the drinking water resources by delineation and application of the wellhead protection areas. For thi...

متن کامل

Parameterized Complexity and Approximation Algorithms

. Proc. Ninth Annual ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA, pp. 394–399. ACM, New York.Page 18 of 19D. MARX THE COMPUTER JOURNAL, 2007 [113] Erlebach, T., Jansen, K. and Seidel, E. (2005) Polynomial-timeapproximation schemes for geometric intersection graphs.SIAM J. Comput., 34, 1302–1323. [114] Hochbaum, D.S. and Maass, W. (1985) Approximationschemes for cov...

متن کامل

Solving random inverse heat conduction problems using PSO and genetic algorithms

The main purpose of this paper is to solve an inverse random differential equation problem using evolutionary algorithms. Particle Swarm Algorithm and Genetic Algorithm are two algorithms that are used in this paper. In this paper, we solve the inverse problem by solving the inverse random differential equation using Crank-Nicholson's method. Then, using the particle swarm optimization algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1978